Program Execution Path-Based Speculative Thread Partitioning
نویسندگان
چکیده
منابع مشابه
Speculative Thread Execution in a Multithreaded Dataflow Architecture
Instruction Level Parallelism (ILP) in modern Superscalar and VLIW processors is achieved using out-of-order execution, branch predictions, value predictions, and speculative executions of instructions. These techniques are not scalable. This has led to multithreading and multi-core systems. However, such processors require compilers to automatically extract thread level or task level paralleli...
متن کاملPutting checkpoints to work in thread level speculative execution
With the advent of Chip Multi Processors (CMPs), improving performance relies on the programmers/compilers to expose thread level parallelism to the underlying hardware. Unfortunately, this is a difficult and error-prone process for the programmers, while state of the art compiler techniques are unable to provide significant benefits for many classes of applications. An interesting alternative ...
متن کاملPartitioning BPEL program for decentralized execution based on Swarm Intelligence
Web services have become the leading technology in business processes management. Business Process Execution Language (BPEL), the standard technology to compose services, assumes a single "orchestrator" that controls the execution flow and coordinates the interactions with selected services. Once its specification has been developed, the composite service may be orchestrated either in a central...
متن کاملSimultaneous Speculation Scheduling - A Technique for Speculative Dual Path Execution
Commodity microprocessors uniformly apply branch prediction and single path speculative execution to all kinds of program branches and suuer from the high misprediction penalty which is caused by branches with low prediction accuracy and, in particular, by branches that are unpredictable. The Simultaneous Speculation Scheduling (S 3) technique removes such penalties by a combination of compiler...
متن کاملExecution Time Minimization Based on Hardware/Software Partitioning and Speculative Prefetch
This report addresses the problem of minimizing the average execution time of an application, based on speculative FPGA configuration prefetch. Dynamically reconfigurable systems (like FPGAs) provide both the performance of hardware acceleration and the flexibility and adaptability that modern applications require. Unfortunately, one of their main drawbacks that significantly impacts performanc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Institute of Systems, Control and Information Engineers
سال: 2009
ISSN: 1342-5668,2185-811X
DOI: 10.5687/iscie.22.209